Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
931	Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?∗ Hirotada Kobayashia b † Keiji Matsumotoa b ‡ Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2009-07-17 07:53:04 Quantum complexity theory Quantum information science Models of computation QMA Interactive proof system PP IP Soundness Quantum computer Theoretical computer science Applied mathematics Computational complexity theory
932	Uriel Feige, Publications, JanuaryPapers are sorted by categories. For papers that have more than one version (typically, journal version and conference proceedings), the diﬀerent versions are combined into one Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2015-01-02 09:14:39 Uriel Feige NP-complete problems Computational complexity theory Adi Shamir Symposium on Theory of Computing International Colloquium on Automata Languages and Programming Symposium on Foundations of Computer Science Approximation algorithm Uriel Theoretical computer science Applied mathematics Mathematics
933	Hardness of Set Cover with Interse tion 1 V.S.Anil Kumar1 , Sunil Arya2 and H.Ramesh3 MPI fur Informatik, Saarbru ken. kumarmpi-sb.mpg.de Department of Computer S ien e, Hong Kong University of S ien e and Te hnology. Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 10:28:02 NP-complete problems Set cover problem Randomized algorithm Theoretical computer science Computational complexity theory Mathematics
934	IEEE Conference on Computational Complexity Paris, 2009 Wednesday:45-9:30 Registration Add to Reading List Source URL: computationalcomplexity.org Language: English - Date: 2012-07-28 21:09:14 Grand Prix de Futsal Camaldolese Hermit Monastery
935	Interactive proofs with efficient quantum prover for recursive Fourier sampling Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2012-09-21 16:35:50 Computational complexity theory Interactive proof system IP Quantum algorithm BQP Quantum computer PP NP Soundness Theoretical computer science Applied mathematics Quantum complexity theory
936	A Multivariate Complexity Analysis of Lobbying in Multiple Referenda Robert Bredereck∗ , Jiehua Chen† , Sepp Hartung, Rolf Niedermeier and Ondˇrej Such´y‡ Stefan Kratsch Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-05-07 11:13:53 Complexity classes Parameterized complexity Mathematical optimization Matrix Kernelization NP Rank 2-satisfiability Theoretical computer science Computational complexity theory Applied mathematics
937	An abridged version of this paper appears in Proceedings of the 37th Symposium on Foundations of Computer Science, IEEE, 1996. Pseudorandom Functions Revisited: The Cascade Construction and its Concrete Security Mihir Be Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2005-10-31 17:44:37 Applied mathematics Algorithmic information theory Pseudorandom generator Computational complexity theory Pseudorandom function family One-way function Advantage Negligible function Function Cryptography Theoretical computer science Pseudorandomness
938	Online Amnesic Approximation of Streaming Time Series Themistoklis Palpanas University of California, Riverside Michail Vlachos Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2003-12-20 03:52:30 Numerical analysis Computational complexity theory Digital signal processing Algorithm Mathematical logic Time complexity Priority queue Piecewise linear function Approximation Theoretical computer science Applied mathematics Mathematical analysis
939	Monday, July 17 9:30-10:30 G¨ odel and Computations, Pavel Pudlak 10:30-11:00 Coffee 11:00-11:30 Polynomial Identity Testing for Depth 3 Circuits, Neeraj Kayal, Nitin Saxena Add to Reading List Source URL: computationalcomplexity.org Language: English - Date: 2012-07-28 21:08:59 Complexity classes Quantum complexity theory Russell Impagliazzo Circuit complexity PP PH Arthur–Merlin protocol Low Advice Theoretical computer science Computational complexity theory Applied mathematics
940	Probabilistic System-on-a-Chip Architectures LAKSHMI N. CHAKRAPANI, PINAR KORKMAZ, BILGE E. S. AKGUL, and KRISHNA V. PALEM Georgia Institute of Technology Parameter variations, noise susceptibility, and increasing energ Add to Reading List Source URL: www.ece.rice.edu Language: English - Date: 2012-08-15 21:59:31 Integrated circuits Digital electronics Electronic design Logic families PSoC Probabilistic complexity theory Randomized algorithm Probabilistic design Algorithm Theoretical computer science Computational complexity theory Electronic engineering

UPDATE